Binary Plane Partitions for Disjoint Line Segments
نویسندگان
چکیده
منابع مشابه
Optimal Binary Space Partitions for Segments in the Plane
An optimal bsp for a set S of disjoint line segments in the plane is a bsp for S that produces the minimum number of cuts. We study optimal bsps for three classes of bsps, which differ in the splitting lines that can be used when partitioning a set of fragments in the recursive partitioning process: free bsps can use any splitting line, restricted bsps can only use splitting lines through pairs...
متن کاملBinary Space Partitions for Axis - Parallel Line Segments : Size - Height
We present worst-case lower bounds on the minimum size of a binary space partition (BSP) tree as a function of its height, for a set S of n axis-parallel line segments in the plane. We assume that the BSP uses only axis-parallel cutting lines. These lower bounds imply that, in the worst case, a BSP tree of height O(log n) must have size (n log n) and a BSP tree of size O(n) must have height (n)...
متن کاملEvery Set of Disjoint Line Segments Admits a Binary
Given a set of n disjoint line segments in the plane, we show that it is always possible to form a tree with the endpoints of the segments such that each line segment is an edge of the tree, the tree has no crossing edges, and the maximum vertex degree of the tree is 3. Furthermore, there exist conngurations of line segments where any such tree requires degree 3. We provide an O(n log n) time a...
متن کاملElementary Partitions of Line Segments in the Plane
Given a set S of line segments in the plane, we introduce a new family of partitions of the convex hull of S called elementary partitions of S. The set of faces of such a partition is a maximal set of disjoint triangles that cut S at, and only at, their vertices. Surprisingly, several properties of point set triangulations extend to elementary partitions. Thus, the number of their faces is an i...
متن کاملForcing Disjoint Segments in the Plane
Consider a geometric graph given by n points in the plane (in general position) andm line segments, each segment joining a pair of the given points. We show that: if m ≥ 3n + 1 then there are 3 pairwise disjoint segments; if m ≥ 10n + 1 then there are 4 disjoint segments; and if m ≥ ckn(log n) k−4 then there are k disjoint segments.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2011
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-011-9341-0